Rigid commutators and a normalizer chain
نویسندگان
چکیده
The novel notion of rigid commutators is introduced to determine the sequence logarithms indices a certain normalizer chain in Sylow 2-subgroup symmetric group on 2^n letters. terms this are proved be those partial sums partitions an integer into at least two distinct parts, that relates famous Euler's partition theorem.
منابع مشابه
Statics of Rigid Units Chain
The statics of one-dimensional rigid units chain subject to stretching force is analyzed. The potential energy of adjacent units interaction is assumed in the simple periodic form (harmonic in the small distortion limit). The position angles of subsequent units are given by the system of two iteration equations, one of them being irreversible. The derived system of equations exhibits interestin...
متن کاملNormalizer Circuits and Quantum Computation
In this thesis, we introduce new models of quantum computation to study the potential and limitations of quantum computer algorithms. Our models are based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and π/4-phase gates) and Gottesman’s stabilizer formalism of quantum codes. We give two main kinds of technical contributions with applications in quantum algorithm design, c...
متن کاملCommutators of A∞ Structures
This note will be for the most part of an expository nature; many of the results here have appeared elsewhere. We would like however, to highlight the connection between Jim Stasheff’s early work on A∞ algebras in the 1960’s and the notion of sh Lie algebras (L∞ algebras) which is currently popular in mathematical physics; see, for example, [1] and [7]. This connection involves some work of Vic...
متن کاملOn Commutators of Isometries and Hyponormal Operators
A sufficient condition is obtained for two isometries to be unitarily equivalent. Also, a new class of M-hyponormal operator is constructed
متن کاملImplementing a Normalizer Using Sized Heterogeneous Types
In the simply-typed lambda-calculus, a hereditary substitution replaces a free variable in a normal form r by another normal form s of type a, removing freshly created redexes on the fly. It can be defined by lexicographic induction on a and r, thus, giving rise to a structurally recursive normalizer for the simply-typed lambda-calculus. We generalize this scheme to simultaneous substitutions, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monatshefte für Mathematik
سال: 2021
ISSN: ['0026-9255', '1436-5081']
DOI: https://doi.org/10.1007/s00605-021-01514-y